Classifying proteinlike sequences in arbitrary lattice protein models using LatPack.
نویسندگان
چکیده
Knowledge of a protein's three-dimensional native structure is vital in determining its chemical properties and functionality. However, experimental methods to determine structure are very costly and time-consuming. Computational approaches such as folding simulations and structure prediction algorithms are quicker and cheaper but lack consistent accuracy. This currently restricts extensive computational studies to abstract protein models. It is thus essential that simplifications induced by the models do not negate scientific value. Key to this is the use of thoroughly defined proteinlike sequences. In such cases abstract models can allow for the investigation of important biological questions. Here, we present a procedure to generate and classify proteinlike sequence data sets. Our LatPack tools and the approach in general are applicable to arbitrary lattice protein models. Identification is based on thermodynamic kinetic features and incorporates the sequential assembly of proteins by addressing cotranslational folding. We demonstrate the approach in the widely used unrestricted 3D-cubic HP-model. The resulting sequence set is the first large data set for this model exhibiting the proteinlike properties required. Our data tools are freely available and can be used to investigate protein-related problems.
منابع مشابه
Folding in two-dimensional off-lattice models of proteins
Off-lattice proteinlike models are constructed in two dimensions so that their native states are close to an on-lattice target. The Hamiltonian involves the Lennard-Jones and harmonic interactions. The native states of these sequences are determined with a high degree of certainty through Monte Carlo processes. The sequences are characterized thermodynamically and kinetically. It is shown that ...
متن کاملComparing the Bidirectional Baum-Welch Algorithm and the Baum-Welch Algorithm on Regular Lattice
A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...
متن کامل“Sequence space soup” of proteins and copolymers
To study the protein folding problem, we use exhaustive computer enumeration to explore “sequence space soup,” an imaginary solution containing the “native” conformations (i.e., of lowest free energy) under folding conditions, of every possible copolymer sequence. The model is of short self-avoiding chains of hydrophobic (H) and polar (P) monomers configured on the two-dimensional square lattic...
متن کاملProtein folding dynamics via quantification of kinematic energy landscape.
We study folding dynamics of proteinlike sequences on a square lattice using a physical move set that exhausts all possible conformational changes. By analytically solving the master equation, we follow the time-dependent probabilities of occupancy of all 802 075 conformations of 16 mers over 7 orders of time span. We find that (i) folding rates of these proteinlike sequences of the same length...
متن کاملCoil-globule transition for regular, random, and specially designed copolymers: Monte Carlo simulation and self-consistent field theory.
The coil-globule transition has been studied for A-B copolymer chains both by means of lattice Monte Carlo (MC) simulations using bond fluctuation algorithm and by a numerical self-consistent-field (SCF) method. Copolymer chains of fixed length with A and B monomeric units with regular, random, and specially designed (proteinlike) primary sequences have been investigated. The dependence of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- HFSP journal
دوره 2 6 شماره
صفحات -
تاریخ انتشار 2008